منابع مشابه
Kernelization Rules for Special Treewidth and Spaghetti Treewidth
Using the framework of kernelization we study whether efficient preprocessing schemes for the Special Treewidth problem can give provable bounds on the size of the processed instances. In this paper it is shown that Special Treewidth has a kernel with O(`) vertices, where ` denotes the size of a vertex cover. This implies that given an instance (G, k) of Special Treewidth we can efficiently red...
متن کاملTreewidth and graph minors
We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under which a graph problem has a polynomial time algorithm (though the algorithms that come out of the theory are often not practical). We shall review a small part of this theory, and illustrate how dynamic programming can be used to solve some NP-hard problems on restricted cla...
متن کاملThe metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملBoxicity and treewidth
An axis-parallel b–dimensional box is a Cartesian product R1 ×R2 ×· · ·×Rb where Ri (for 1 ≤ i ≤ b) is a closed interval of the form [ai, bi] on the real line. For a graph G, its boxicity box(G) is the minimum dimension b, such that G is representable as the intersection graph of (axis–parallel) boxes in b–dimensional space. The concept of boxicity finds applications in various areas such as ec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2005
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2004.05.004